Interactive Theorem Proving with Temporal Logic
نویسندگان
چکیده
منابع مشابه
Interactive Theorem Proving with Temporal Logic
In this paper, we present a theorem prover for linear temporal logic. Our goal is to extend the capabilities of existing interactive and automatic systems for verifying temporal properties of software and hardware systems. We focus on increasing the eeectiveness of user interaction in such systems. In particular, we extend the techniques of proof by pointing and point and shoot for mouse-driven...
متن کاملTheorem-Proving for Discrete Temporal Logic
This chapter considers theorem proving for discrete temporal logics. We are interested in deciding or at least enumerating the formulas of the logic which are valid, that is, are true in all circumstances. Most of the techniques for temporal theorem-proving have been extensions for methods developed for classical logics but completely novel techniques have also been developed. Initially we conc...
متن کاملInteractive Theorem Proving with Tasks
Interactive theorem proving systems for mathematics require user interfaces which allow for user interaction that is as natural as possible. However, this interaction is often limited by the traditional calculi underlying most theorem proving systems. This is particularly problematic with respect to the application of assertions and intuitive presentation of proof states. In this paper we show ...
متن کاملTemporal Logic Model Checking as Automated Theorem Proving
Model checking is an automatic technique for the verification of temporal properties of a system. In this technique, a system is represented as a labelled graph and the specification as a temporal logic formula. The core of temporal logic model checking is the reachability problem, which is not expressible in first-order logic (FOL); as a result, model checking of finite/infinite state systems ...
متن کاملTheorem Proving for Metric Temporal Logic over the Naturals
We study translations from Metric Temporal Logic (MTL) over the natural numbers to Linear Temporal Logic (LTL). In particular, we present two approaches for translating from MTL to LTL which preserve the ExpSpace complexity of the satisfiability problem for MTL. In each of these approaches we consider the case where the mapping between states and time points is given by (1) a strict monotonic f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1997
ISSN: 0747-7171
DOI: 10.1006/jsco.1996.0094